Isorange Pairwise Orthogonal Transform
نویسندگان
چکیده
منابع مشابه
On the hardware implementation of the arithmetic elements of the pairwise orthogonal transform
The pairwise orthogonal transform (POT) is an attractive alternative to the Kahrunen– Loève transform for spectral decorrelation in on-board multispectral and hyperspectral image compression due to its reduced complexity. This work validates that the low complexity of the POT makes it feasible for a space-qualified field-programmable gate array (FPGA) implementation. A register transfer level d...
متن کاملAn Orthogonal Discrete Auditory Transform
An orthogonal discrete auditory transform (ODAT) from sound signal to spectrum is constructed by combining the auditory spreading matrix of Schroeder et al and the time one map of a discrete nonlocal Schrödinger equation. Thanks to the dispersive smoothing property of the Schrödinger evolution, ODAT spectrum is smoother than that of the discrete Fourier transform (DFT) consistent with human aud...
متن کاملSets of three pairwise orthogonal Steiner triple systems
Two Steiner triple systems (STS) are orthogonal if their sets of triples are disjoint, and two disjoint pairs of points defining intersecting triples in one system fail to do so in the other. In 1994, it was shown [2] that there exist a pair of orthogonal Steiner triple systems of order v for all v ≡ 1, 3 (mod 6), with v ≥ 7, v 6= 9. In this paper we show that there exist three pairwise orthogo...
متن کاملNew bounds for pairwise orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. Let dr be the least integer such that for all n > dr there exist r pairwise orthogonal diagonal Latin squares of order n. In a previous paper Wallis and Zhu gave several bounds on the dr. In this paper we shall present some constructions of pairwise orthogonal diagonal Latin squares and conseq...
متن کاملOrthogonal Approximation of the Discrete Cosine Transform
The eecient implementation of the discrete cosine tansform is discussed in this paper. The architecture, that is used, is a systolic processor array consisting of orthonormal rotations. The angles of these rotations are denoted by ij. With respect to a simple VLSI implementation an approximation of the DCT is realized. The approximation is obtained by using approximate (orthogonal) rotations. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Geoscience and Remote Sensing
سال: 2015
ISSN: 0196-2892,1558-0644
DOI: 10.1109/tgrs.2014.2374473